Optimising Test Execution Times in Test Suite Generation

نویسندگان

  • Tilo Mücke
  • Michaela Huhn
چکیده

In the last decade, enormous progress has been made in generating test cases for coverage criteria automatically via model checking. However, many approaches suffer from generating large test suites with long test execution times. In recent work, we developed a method to generate test suites from state-based design models with the shortest test execution time satisfying a given set of coverage criteria. We were able to show that valuable improvements can be achieved. But space complexity of generating the fastest test suite turned out to be too high; thus our approach was limited to small models. Alternatively, a model checker can be called several times, each run generating a single test case. Thereby, the space complexity problem is solved. To build a test suite with minimised execution time, optimisations have to be applied afterwards. Here we present and compare several such algorithms to optimise test suites with respect to execution time.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Directed Test Generation for Improved Fault Localization

Fault-localization techniques that apply statistical analyses to execution data gathered from multiple tests are quite effective when a large test suite is available. However, if no test suite is available, what is the best approach to generate one? This paper investigates the fault-localization effectiveness of test suites generated according to several test-generation techniques based on comb...

متن کامل

An Efficient Test Data Generation Approach for Unit Testing

To ensure the delivery of high-quality software, software testing plays the vital role. One of the major time-consuming and expensive activities in software testing is the generation of test data. Test data generation activity has a strong impact on the effectiveness and efficiency of the whole testing process. In order to reduce the cost and time involved in the process of test data generation...

متن کامل

Using the Particle Swarm Optimization Algorithm to Generate the Minimum Test Suite in Covering Array with Uniform Strength

Up to now, several useful algorithms have been proposed to generate covering array, which is one of the branches of combinatorial testing. The main challenge in generating such arrays is generation of the arrays with a minimum number of test cases (for efficiency) at a proper time (for performance), for large systems. Covering array generation strategies are often divided into two general categ...

متن کامل

2 Architecture User Interface Behavior Model Execution Directives Generation Directives Compiler Analyzers Edit / Browser Execution Trace

Test Suite Test Suite Trace The first three interfaces are for the users’ primary access to the tools. The latter three are more for internal use by the tools, but the abstract test suite may also be directly used by a user to script a particular test case. 3.1 Behavioural Modeling Language The behavioural model describes the behaviour of the system under test. It is implemented as a UML profil...

متن کامل

Breeding Software Test Cases with Genetic Algorithms

The genetic algorithm includes a fossil record that records past organisms, allowing any current fitness calculations to be influenced by past generations. This paper describes breeding software test cases using genetic algorithms as part of a software testing cycle. An evolving fitness function that relies on a fossil record of organisms results in search behavior, based on the concept of nove...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005